Edit a staff round.

Efficient Deterministic Single Round Document Exchange for Edit Distance

Suppose that we have two parties that possess each a binary string. Suppose that the length of the first string (document) is n and that the two strings (documents) have edit distance (minimal number of deletes, inserts and substitutions needed to transform one string into the other) at most k. The problem we want to solve is to devise an efficient protocol in which the first party sends a sing...

Document Edit Edit Edit Digitalsignature Incrementalsigning Algorithm Standardsigning Algorithm

We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, an oblivious data structure yields no knowledge about the sequence of operations that have been applied to it other than the nal result of the operations. In particular we deene Oblivious Tree, a data structure very similar to 2-3 Tree, but with the additional property that ...

Document Edit Edit Edit Digitalsignature Incrementalsigning Algorithm Standardsigning Algorithm

CM1_Amit edit

Background: Awareness on human immuno-deficiency virus (HIV)/acquired immuno-deficiency syndrome (AIDS) can help reduce the risk of contracting this public health important disease and associated burdens. However, today’s adolescent grows up surrounded by mixed messages about HIV/AIDS. Objectives: To assess awareness on HIV/AIDS among adolescent students. Methods: A cross-sectional study was co...

OR1_CR_Sanjay edit

Copyright: © the author(s), publisher. Annals of International Medical and Dental Research (AIMDR) is an Official Publication of “Society for Health Care & Research Development”. It is an open-access article distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided ...